Isomorphisms preserving invariants
نویسندگان
چکیده
منابع مشابه
Isomorphisms Preserving Invariants
Let V and W be finite dimensional real vector spaces and let G ⊂ GL(V ) and H ⊂ GL(W ) be finite subgroups. Assume for simplicity that the actions contain no reflections. Let Y and Z denote the real algebraic varieties corresponding to R[V ] and R[W ] , respectively. If V and W are quasi-isomorphic, i.e., if there is a linear isomorphism L : V → W such that L sends G-orbits to H-orbits and L se...
متن کاملC∗-Isomorphisms, Jordan Isomorphisms, and Numerical Range Preserving Maps
Let V = B(H) or S(H), where B(H) is the algebra of bounded linear operator acting on the Hilbert space H, and S(H) is the set of self-adjoint operators in B(H). Denote the numerical range of A ∈ B(H) by W (A) = {(Ax, x) : x ∈ H, (x, x) = 1}. It is shown that a surjective map φ : V→ V satisfies W (AB +BA) =W (φ(A)φ(B) + φ(B)φ(A)) for all A,B ∈ V if and only if there is a unitary operator U ∈ B(H...
متن کاملLinear Maps Preserving Invariants
Let G ⊂ GL(V ) be a complex reductive group. Let G denote {φ ∈ GL(V ) | p◦φ = p for all p ∈ C[V ]}. We show that, in general, G = G. In case G is the adjoint group of a simple Lie algebra g, we show that G is an order 2 extension of G. We also calculate G for all representations of SL2.
متن کاملASM Refinement Preserving Invariants
This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal verification of the refinements of the Mondex case study with the interactive theorem prover KIV. The refinement definition we give differs from the one we gave in earlier work which preserves partial and total correctne...
متن کاملModel Programs for Preserving Composite Invariants
We describe a solution for the SAVCBS challenge problem: a technique for specifying and verifying invariants for objects designed using the Composite design pattern. The solution presents a greybox specification technique using JML’s model program feature. We show that model program specifications function as exemplars for capturing helper method calls in a way that preserves modularity and enc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2009
ISSN: 0046-5755,1572-9168
DOI: 10.1007/s10711-009-9367-0